Large Scale Linear System Global Computing Resolution with GMRES Method
نویسندگان
چکیده
Grid computing attains high throughput computing by making use of a very large amount of unexploited computing resources. We present a typical parallel method GMRES to solve large sparse linear systems by the use of a lightweight GRID system XtremWeb. This global computing platform, just as many popular GRID systems, is mainly devoted to multi-parameters generic applications. We have implemented this important algorithm GMRES which is one of the key methods to resolve large, non-symmetric, linear problems. We discuss as well the performances of this implementation deployed on two XtremWeb networks: a local network with 128 nondedicated PCs in Polytech-Lille of University of Lille I in France, a remote network with 3 clusters of SCGN Grid that includes 91 CPUs totally in the High Performance Center for Computational Science of University of Tsukuba in Japan. We do the tests as well on the platform of supercomputer IBM SP4 and in a LAN MPI computing environment LAMMPI. We compare these performances. We present the advantages and drawbacks of our implementations on the three computing systems.
منابع مشابه
Theoretical results on the global GMRES method for solving generalized Sylvester matrix equations
The global generalized minimum residual (Gl-GMRES) method is examined for solving the generalized Sylvester matrix equation [sumlimits_{i = 1}^q {A_i } XB_i = C.] Some new theoretical results are elaborated for the proposed method by employing the Schur complement. These results can be exploited to establish new convergence properties of the Gl-GMRES method for solving genera...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملA weighted global GMRES algorithm with deflation for solving large Sylvester matrix equations
The solution of large scale Sylvester matrix equation plays an important role in control and large scientific computations. A popular approach is to use the global GMRES algorithm. In this work, we first consider the global GMRES algorithm with weighting strategy, and propose some new schemes based on residual to update the weighting matrix. Due to the growth of memory requirements and computat...
متن کاملThe Communication-Hiding Conjugate Gradient Method with Deep Pipelines
Krylov subspace methods are among the most efficient present-day solvers for large scale linear algebra problems. Nevertheless, classic Krylov subspace method algorithms do not scale well on massively parallel hardware due to the synchronization bottlenecks induced by the computation of dot products throughout the algorithms. Communication-hiding pipelined Krylov subspace methods offer increase...
متن کاملA Cost-effective Ilu Preconditioner for Weather Simulation
To date, the most efficient solver used in the weather sciences for the resolution of linear system in numerical weather prediction is the generalized minimal residual method called GMRES. However, difficulties still appear in matrix resolution when the GMRES iterative method is used without an appropriate preconditioner. For improving the computation speed in numerically solving weather equati...
متن کامل